Implementation of a three-quantum-bit search algorithm
نویسندگان
چکیده
منابع مشابه
Implementation of a three-quantum-bit search algorithm
We report the experimental implementation of Grover’s quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of C-labeled CHFBr2, in which the three weakly coupled spin-1/2 nuclei behave as the bits and are initialized, manipulated, and read out using magnetic resonance techniques. This quantum computation is made possible by the introduction ...
متن کاملFirst implementation of a three quantum bit search algorithm
We report the first experimental implementation of Grover’s quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of C-labeled CHFBr2, in which the three weakly coupled spin-1/2 nuclei behave as the bits and are initialized, manipulated, and read out using magnetic resonance techniques. This is the most complex quantum computation implemented...
متن کاملExperimental Implementation of Hogg’s Algorithm on a Three-Quantum-bit NMR Quantum Computer
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found wi...
متن کاملImplementation of the refined Deutsch - Jozsa algorithm on a three - bit NMR quantum computer
We implemented the refined Deutsch-Jozsa algorithm on a three-bit nuclear magnetic resonance quantum computer. All of the balanced and constant functions were realized exactly. The results agree well with theoretical predictions and clearly distinguish the balanced functions from constant functions. Efficient refocusing schemes were proposed for the soft z pulse and J coupling, and it is shown ...
متن کاملImplementation of Grover’s quantum search algorithm in a scalable system
We report the implementation of Grover’s quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space, the marked element is successfully recovered with an average probability of 60 2 %. This exceeds the performance of any possible classical search algorithm, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Physics Letters
سال: 2000
ISSN: 0003-6951,1077-3118
DOI: 10.1063/1.125846